Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops
نویسندگان
چکیده
This paper presents a new approach for computing the transitive closure of a union of relations describing all the dependences in both uniform and quasi-uniform perfectly-nested parameterized loops. This approach is based on calculating the basis of a dependence distance vectors set. The procedure has polynomial time complexity for most steps of calculations. This allows us to effectively extract both fineand coarse-grained parallelism in loops using techniques based on applying the transitive closure of dependence relations. The effectiveness and time complexity of the approach are evaluated for loops provided by the NAS Parallel Benchmark Suite.
منابع مشابه
Using transitive closure and transitive reduction to extract coarse-grained parallelism in program loops
A technique for extracting coarse-grained parallelism available in loops is presented. It is based on splitting a set of dependence relations into two sets. The first one is to be used for generating code scanning slices while the second one permits us to insert send and receive functions to synchronize the slices execution. The paper presents a way demonstrating how to remove redundant synchro...
متن کاملThe Powerset Algebra as a Natural Tool to Handle Nested Database Relations
The nested relational algebra is often inadequate as a tool to handle nested relations, since several important queries, such as transitive closure, cannot expressed by it. On the other hand, the powerset algebra does allow the expression of transitive closure, but in a too expensive way. Therefore, we consider various other extensions to the nested algebra, such as least tixpoint and programmi...
متن کاملComputing the Transitive Closure of a Union of Affine Integer Tuple Relations
This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to compute the transitive closure exist for convex polyhedra only. In presence of non-convex relations, there exist little but special cases and incomplete heuristics. We introduce a novel sufficient and necessary condition defining ...
متن کاملFinding Free Schedules for Non-uniform Loops
An algorithm, permitting us to build free schedules for arbitrary nested non–uniform loops, is presented. The operations of each time schedule can be executed as soon as their operands are available. The algorithm requires exact dependence analysis. To describe and implement the algorithm and to carry out experiences, the dependence analysis by Pugh and Wonnacott was chosen where dependences ar...
متن کاملEmbedding an analytic equivalence relation in the transitive closure of a Borel relation
The transitive closure of a reflexive, symmetric, analytic relation is an analytic equivalence relation. Does some smaller class contain the transitive closure of every reflexive, symmetric, closed relation? An essentially negative answer is provided here. Every analytic equivalence relation on an arbitrary Polish space is Borel embeddable in the transitive closure of the union of two smooth Bo...
متن کامل